ReP USP - Resultado da busca

Trabalho de evento-resumo periodico
Hamiltonian cycles in kneser graphs for n = 2k+ 2 (2011)
Bueno, L. R; Figueiredo, Celina Miraglia Herrera de; Faria, Luerbio; Mendonça Neto, Candido Ferreira Xavier de; Hausen, Rodrigo de Alencar
Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS'11. Unidade: EACH
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BUENO, L. R et al. Hamiltonian cycles in kneser graphs for n = 2k+ 2. Electronic Notes in Discrete Mathematics. Amsterdam: Escola de Artes, Ciências e Humanidades, Universidade de São Paulo. . Acesso em: 28 abr. 2024. , 2011
APA
Bueno, L. R., Figueiredo, C. M. H. de, Faria, L., Mendonça Neto, C. F. X. de, & Hausen, R. de A. (2011). Hamiltonian cycles in kneser graphs for n = 2k+ 2. Electronic Notes in Discrete Mathematics. Amsterdam: Escola de Artes, Ciências e Humanidades, Universidade de São Paulo.
NLM
Bueno LR, Figueiredo CMH de, Faria L, Mendonça Neto CFX de, Hausen R de A. Hamiltonian cycles in kneser graphs for n = 2k+ 2. Electronic Notes in Discrete Mathematics. 2011 ; 37 291-296.[citado 2024 abr. 28 ]
Vancouver
Bueno LR, Figueiredo CMH de, Faria L, Mendonça Neto CFX de, Hausen R de A. Hamiltonian cycles in kneser graphs for n = 2k+ 2. Electronic Notes in Discrete Mathematics. 2011 ; 37 291-296.[citado 2024 abr. 28 ]
Trabalho de evento-anais periodico
Bounds on the transposition distance for lonely permutations (2010)
Kowada, Luis Antonio Brasil; Hausen, Rodrigo de Alencar; Figueiredo, Celina Miraglia Herrera de
Source: Lecture Notes in Computer Science. Conference titles: Brazilian Symposium on Bioinformatics - BSB. Unidade: EACH
Assunto: BIOINFORMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOWADA, Luis Antonio Brasil e HAUSEN, Rodrigo de Alencar e FIGUEIREDO, Celina Miraglia Herrera de. Bounds on the transposition distance for lonely permutations. Lecture Notes in Computer Science. Heidelberg: Springer-Verlag. Disponível em: https://doi.org/10.1007/978-3-642-15060-9_4. Acesso em: 28 abr. 2024. , 2010
APA
Kowada, L. A. B., Hausen, R. de A., & Figueiredo, C. M. H. de. (2010). Bounds on the transposition distance for lonely permutations. Lecture Notes in Computer Science. Heidelberg: Springer-Verlag. doi:10.1007/978-3-642-15060-9_4
NLM
Kowada LAB, Hausen R de A, Figueiredo CMH de. Bounds on the transposition distance for lonely permutations [Internet]. Lecture Notes in Computer Science. 2010 ; 6268 35-46.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1007/978-3-642-15060-9_4
Vancouver
Kowada LAB, Hausen R de A, Figueiredo CMH de. Bounds on the transposition distance for lonely permutations [Internet]. Lecture Notes in Computer Science. 2010 ; 6268 35-46.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1007/978-3-642-15060-9_4
Artigo de periodico
Skewness, splitting number and vertex deletion of some toroidal meshes (2009)
Mendonça Neto, Candido Ferreira Xavier de; Constantino, Ademir Aparecido; Xavier, Erico Fabrício; Stolfi, Jorge; Faria, Luerbio; Figueiredo, Celina Miraglia Herrera de
Source: Ars Combinatoria. Unidade: EACH
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MENDONÇA NETO, Candido Ferreira Xavier de et al. Skewness, splitting number and vertex deletion of some toroidal meshes. Ars Combinatoria, v. 92, p. 53-65, 2009Tradução . . Acesso em: 28 abr. 2024.
APA
Mendonça Neto, C. F. X. de, Constantino, A. A., Xavier, E. F., Stolfi, J., Faria, L., & Figueiredo, C. M. H. de. (2009). Skewness, splitting number and vertex deletion of some toroidal meshes. Ars Combinatoria, 92, 53-65.
NLM
Mendonça Neto CFX de, Constantino AA, Xavier EF, Stolfi J, Faria L, Figueiredo CMH de. Skewness, splitting number and vertex deletion of some toroidal meshes. Ars Combinatoria. 2009 ; 92 53-65.[citado 2024 abr. 28 ]
Vancouver
Mendonça Neto CFX de, Constantino AA, Xavier EF, Stolfi J, Faria L, Figueiredo CMH de. Skewness, splitting number and vertex deletion of some toroidal meshes. Ars Combinatoria. 2009 ; 92 53-65.[citado 2024 abr. 28 ]
Artigo de periodico-apres/intr
This special issue of Discrete Applied Mathematics is dedicated to the Second Brazilian Symposium on Graphs, Algorithms and Combinatorics... [Apresentação] (2008)
Feofiloff, Paulo ; Figueiredo, Celina Miraglia Herrera de; Wakabayashi, Yoshiko
Source: Discrete Applied Mathematics. Unidade: IME
Subjects: TEORIA DOS GRAFOS, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FEOFILOFF, Paulo e FIGUEIREDO, Celina Miraglia Herrera de e WAKABAYASHI, Yoshiko. This special issue of Discrete Applied Mathematics is dedicated to the Second Brazilian Symposium on Graphs, Algorithms and Combinatorics.. [Apresentação]. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.dam.2007.07.017. Acesso em: 28 abr. 2024. , 2008
APA
Feofiloff, P., Figueiredo, C. M. H. de, & Wakabayashi, Y. (2008). This special issue of Discrete Applied Mathematics is dedicated to the Second Brazilian Symposium on Graphs, Algorithms and Combinatorics.. [Apresentação]. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.dam.2007.07.017
NLM
Feofiloff P, Figueiredo CMH de, Wakabayashi Y. This special issue of Discrete Applied Mathematics is dedicated to the Second Brazilian Symposium on Graphs, Algorithms and Combinatorics.. [Apresentação] [Internet]. Discrete Applied Mathematics. 2008 ; 156( 7): 985.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.dam.2007.07.017
Vancouver
Feofiloff P, Figueiredo CMH de, Wakabayashi Y. This special issue of Discrete Applied Mathematics is dedicated to the Second Brazilian Symposium on Graphs, Algorithms and Combinatorics.. [Apresentação] [Internet]. Discrete Applied Mathematics. 2008 ; 156( 7): 985.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.dam.2007.07.017
Editor de periodico
GRACO 2005: 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics (2008)
Feofiloff, Paulo (Editor) ; Figueiredo, Celina Miraglia Herrera de (Editor); Wakabayashi, Yoshiko (Editor)
Source: Discrete Applied Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics - GRACO. Unidade: IME
Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GRACO 2005: 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics. Discrete Applied Mathematics. Amsterdam: Elsevier. Disponível em: https://www.sciencedirect.com/journal/discrete-applied-mathematics/vol/156/issue/7. Acesso em: 28 abr. 2024. , 2008
APA
GRACO 2005: 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics. (2008). GRACO 2005: 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics. Discrete Applied Mathematics. Amsterdam: Elsevier. Recuperado de https://www.sciencedirect.com/journal/discrete-applied-mathematics/vol/156/issue/7
NLM
GRACO 2005: 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics [Internet]. Discrete Applied Mathematics. 2008 ; 156( 7): 985-1180.[citado 2024 abr. 28 ] Available from: https://www.sciencedirect.com/journal/discrete-applied-mathematics/vol/156/issue/7
Vancouver
GRACO 2005: 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics [Internet]. Discrete Applied Mathematics. 2008 ; 156( 7): 985-1180.[citado 2024 abr. 28 ] Available from: https://www.sciencedirect.com/journal/discrete-applied-mathematics/vol/156/issue/7
Artigo de periodico
On maximum planar induced subgraphs (2006)
Faria, Luerbio; Figueiredo, Celina Miraglia Herrera de; Gravier, Sylvain; Mendonça Neto, Candido Ferreira Xavier de; Stolfi, Jorge
Source: Discrete Applied Mathematics. Unidade: EACH
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FARIA, Luerbio et al. On maximum planar induced subgraphs. Discrete Applied Mathematics, v. 154, n. 13, p. 1774-1782, 2006Tradução . . Disponível em: https://doi.org/10.1016/j.dam.2006.03.021. Acesso em: 28 abr. 2024.
APA
Faria, L., Figueiredo, C. M. H. de, Gravier, S., Mendonça Neto, C. F. X. de, & Stolfi, J. (2006). On maximum planar induced subgraphs. Discrete Applied Mathematics, 154( 13), 1774-1782. doi:10.1016/j.dam.2006.03.021
NLM
Faria L, Figueiredo CMH de, Gravier S, Mendonça Neto CFX de, Stolfi J. On maximum planar induced subgraphs [Internet]. Discrete Applied Mathematics. 2006 ; 154( 13): 1774-1782.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.dam.2006.03.021
Vancouver
Faria L, Figueiredo CMH de, Gravier S, Mendonça Neto CFX de, Stolfi J. On maximum planar induced subgraphs [Internet]. Discrete Applied Mathematics. 2006 ; 154( 13): 1774-1782.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.dam.2006.03.021
Editor de periodico
Proceedings of GRACO 2005: the 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics (2005)
Feofiloff, Paulo (Editor) ; Figueiredo, Celina Miraglia Herrera de (Editor); Wakabayashi, Yoshiko (Editor)
Source: Electronic Notes in Discrete Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics - GRACO. Unidade: IME
Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
Proceedings of GRACO 2005: the 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. Disponível em: https://www.sciencedirect.com/journal/electronic-notes-in-discrete-mathematics/vol/19/suppl/C. Acesso em: 28 abr. 2024. , 2005
APA
Proceedings of GRACO 2005: the 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics. (2005). Proceedings of GRACO 2005: the 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. Recuperado de https://www.sciencedirect.com/journal/electronic-notes-in-discrete-mathematics/vol/19/suppl/C
NLM
Proceedings of GRACO 2005: the 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics [Internet]. Electronic Notes in Discrete Mathematics. 2005 ; 19 1-416.[citado 2024 abr. 28 ] Available from: https://www.sciencedirect.com/journal/electronic-notes-in-discrete-mathematics/vol/19/suppl/C
Vancouver
Proceedings of GRACO 2005: the 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics [Internet]. Electronic Notes in Discrete Mathematics. 2005 ; 19 1-416.[citado 2024 abr. 28 ] Available from: https://www.sciencedirect.com/journal/electronic-notes-in-discrete-mathematics/vol/19/suppl/C
Artigo de periodico-apres/intr
Proceedings of GRACO 2005 the 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics. [Preface] (2005)
Feofiloff, Paulo ; Figueiredo, Celina Miraglia Herrera de; Wakabayashi, Yoshiko
Source: Electronic Notes in Discrete Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics - GRACO. Unidade: IME
Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FEOFILOFF, Paulo e FIGUEIREDO, Celina Miraglia Herrera de e WAKABAYASHI, Yoshiko. Proceedings of GRACO 2005 the 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics. [Preface]. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2005.05.002. Acesso em: 28 abr. 2024. , 2005
APA
Feofiloff, P., Figueiredo, C. M. H. de, & Wakabayashi, Y. (2005). Proceedings of GRACO 2005 the 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics. [Preface]. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2005.05.002
NLM
Feofiloff P, Figueiredo CMH de, Wakabayashi Y. Proceedings of GRACO 2005 the 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics. [Preface] [Internet]. Electronic Notes in Discrete Mathematics. 2005 ; 19 1-7.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.endm.2005.05.002
Vancouver
Feofiloff P, Figueiredo CMH de, Wakabayashi Y. Proceedings of GRACO 2005 the 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics. [Preface] [Internet]. Electronic Notes in Discrete Mathematics. 2005 ; 19 1-7.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.endm.2005.05.002
Artigo de periodico
Finding skew partitions efficiently (2000)
Figueiredo, Celina Miraglia Herrera de; Klein, Sulamita; Kohayakawa, Yoshiharu ; Reed, Bruce A.
Source: Journal of Algorithms. Unidade: IME
Subjects: ALGORITMOS E ESTRUTURAS DE DADOS, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FIGUEIREDO, Celina Miraglia Herrera de et al. Finding skew partitions efficiently. Journal of Algorithms, v. 37, n. 2, p. 505-521, 2000Tradução . . Disponível em: https://doi.org/10.1006/jagm.1999.1122. Acesso em: 28 abr. 2024.
APA
Figueiredo, C. M. H. de, Klein, S., Kohayakawa, Y., & Reed, B. A. (2000). Finding skew partitions efficiently. Journal of Algorithms, 37( 2), 505-521. doi:10.1006/jagm.1999.1122
NLM
Figueiredo CMH de, Klein S, Kohayakawa Y, Reed BA. Finding skew partitions efficiently [Internet]. Journal of Algorithms. 2000 ; 37( 2): 505-521.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1006/jagm.1999.1122
Vancouver
Figueiredo CMH de, Klein S, Kohayakawa Y, Reed BA. Finding skew partitions efficiently [Internet]. Journal of Algorithms. 2000 ; 37( 2): 505-521.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1006/jagm.1999.1122
Trabalho de evento
Finding skew partitions efficiently (2000)
Figueiredo, Celina Miraglia Herrera de; Klein, Sulamita; Kohayakawa, Yoshiharu ; Reed, Bruce A
Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. Unidade: IME
Assunto: ALGORITMOS E ESTRUTURAS DE DADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FIGUEIREDO, Celina Miraglia Herrera de et al. Finding skew partitions efficiently. 2000, Anais.. Berlin: Springer, 2000. Disponível em: https://doi.org/10.1007/10719839_18. Acesso em: 28 abr. 2024.
APA
Figueiredo, C. M. H. de, Klein, S., Kohayakawa, Y., & Reed, B. A. (2000). Finding skew partitions efficiently. In Proceedings. Berlin: Springer. doi:10.1007/10719839_18
NLM
Figueiredo CMH de, Klein S, Kohayakawa Y, Reed BA. Finding skew partitions efficiently [Internet]. Proceedings. 2000 ;[citado 2024 abr. 28 ] Available from: https://doi.org/10.1007/10719839_18
Vancouver
Figueiredo CMH de, Klein S, Kohayakawa Y, Reed BA. Finding skew partitions efficiently [Internet]. Proceedings. 2000 ;[citado 2024 abr. 28 ] Available from: https://doi.org/10.1007/10719839_18

USP Schools

ReP

Filtros

Document Types

Authors

Date published

Subjects

Source title

Funding Agencies

Non normalized affiliation